Minimum distance-unbalancedness of trees

A Distributed Algorithm for Minimum Distance-k Domination in Trees

While efficient algorithms for finding minimal distance-k dominating sets exist, finding minimum such sets is NP-hard even for bipartite graphs. This paper presents a distributed algorithm to determine a minimum (connected) distance-k dominating set and a maximum distance-2k independent set of a tree T . It terminates in O(height(T )) rounds and uses O(log k) space. To the best of our knowledge...

Geometric Minimum Spanning Trees

Let S be a set of n points in < d. We present an algorithm that uses the well-separated pair decomposition and computes the minimum spanning tree of S under any Lp or polyhedral metric. It has an expected running time of O(n logn) for uniform distributions. Experimentalresults show that this approachis practical. Under a variety of input distributions, the resultingimplementation is robust and ...

Minimum Spanning Trees∗

1 Background Members of some secret party want to shutdown some high risk communication channals, while preserving low risk channals to ensure that members are still connected in the secret network.

Minimum Density Interconnection Trees

IYe discuss a new minimum density objectave for spanning and Steaner tree constructaons. This formu-latzoii is motzvated b y the need for balanced usage of routang resources t o achaeve iiztnzmum-area VLSI layouts. We present eficient heunstzcs for constructnng low-density spaniazng trees, and prove that their outputs are on average wafhzn small constants of optimal with respeci to both tree we...

Geometri Minimum Spanning Trees